A Reweighted Symmetric Smoothed Function Approximating L0-Norm Regularized Sparse Reconstruction Method
نویسندگان
چکیده
منابع مشابه
Complex-valued sparse representation based on smoothed l0 norm
In this paper we present an algorithm for complex-valued sparse representation. In our previous work we presented an algorithm for Sparse representation based on smoothed norm. Here we extend that algorithm to complex-valued signals. The proposed algorithm is compared to FOCUSS algorithm and it is experimentally shown that the proposed algorithm is about two or three orders of magnitude faster ...
متن کاملFast Sparse Representation Based on Smoothed l0 Norm
In this paper, a new algorithm for Sparse Component Analysis (SCA) or atomic decomposition on over-complete dictionaries is presented. The algorithm is essentially a method for obtaining sufficiently sparse solutions of underdetermined systems of linear equations. The solution obtained by the proposed algorithm is compared with the minimum `-norm solution achieved by Linear Programming (LP). It...
متن کاملApproximate Sparse Decomposition Based on Smoothed L0-Norm
In this paper, we propose a method to address the problem of source estimation for Sparse Component Analysis (SCA) in the presence of additive noise. Our method is a generalization of a recently proposed method (SL0), which has the advantage of directly minimizing the ℓ 0-norm instead of ℓ 1-norm, while being very fast. SL0 is based on minimization of the smoothed ℓ 0-norm subject to As = x. In...
متن کاملSmoothed l0 Norm Regularization for Sparse-View X-Ray CT Reconstruction
Low-dose computed tomography (CT) reconstruction is a challenging problem in medical imaging. To complement the standard filtered back-projection (FBP) reconstruction, sparse regularization reconstruction gains more and more research attention, as it promises to reduce radiation dose, suppress artifacts, and improve noise properties. In this work, we present an iterative reconstruction approach...
متن کاملL0-norm Sparse Graph-regularized SVD for Biclustering
Learning the “blocking” structure is a central challenge for high dimensional data (e.g., gene expression data). In [Lee et al., 2010], a sparse singular value decomposition (SVD) has been used as a biclustering tool to achieve this goal. However, this model ignores the structural information between variables (e.g., gene interaction graph). Although typical graph-regularized norm can incorpora...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2018
ISSN: 2073-8994
DOI: 10.3390/sym10110583